Dynamic Load Balancing Strategies in Heterogeneous Distributed System

نویسندگان

  • Bibhudatta Sahoo
  • Sudipta Mahapatra
چکیده

Distributed heterogeneous computing is being widely applied to a variety of large size computational problems. This computational environments are consists of multiple heterogeneous computing modules, these modules interact with each other to solve the problem. Dynamic load balancing in distributed computing system is desirable because it is an important key to establish dependability in a Heterogeneous Distributed Computing Systems (HDCS). Load balancing problem is an optimization problem with exponential solution space. The complexity of dynamic load balancing increases with the size of a HDCS and becomes difficult to solve effectively. The solution to this intractable problem is discussed under different algorithm paradigm. The load submitted to the a HDCS is assumed to be in the form of tasks. Dynamic allocation of n independent tasks to m computing nodes in heterogeneous distributed computing system can be possible through centralized or decentralized control. In centralized approach,we have formulated load balancing problem considering task and machine heterogeneity as a linear programming problem to minimize the time by which all task completes the execution in makespan. The load balancing problem in HDCS aims to maintain a balanced allocation of tasks while using the computational resources. The system state changes with time on arrival of tasks from the users. Therefore, heterogeneous distributed system is modeled as an M/M/m queue. The task model is represented either as a consistent or an inconsistent expected time to compute (ETC) matrix. A batch mode heuristic has been used to design dynamic load balancing algorithms for heterogeneous distributed computing systems with four different type of machine heterogeneity. A number of experiments have been conducted to study the performance of load balancing algorithms with three different arrival rate for the task. A better performance of the algorithms is observed with increasing of heterogeneity in the HDCS. A new codification scheme suitable to simulated annealing and genetic algorithm has been introduced to design dynamic load balancing algorithms for HDCS. These stochastic iterative load balancing algorithms uses sliding window techniques to select a batch of tasks, and allocate them to the computing nodes in the HDCS. The proposed dynamic genetic algorithm based load balancer has been found to be effective, especially in the case of a large number of tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Experiences with Task Scheduling Strategies for Image Processing Application on Heterogeneous Distributed Computing System

Heterogeneous Distributed Computing (HDC) system consists of Workstations (WSs) and Personal Computers (PCs). In HDC system, each WS/PC may have different processor and performance. In order to take advantage of this diversity of processing power of a system, an effective task partitioning, scheduling, and load balancing are needed to get the optimum performance. This paper examines the effecti...

متن کامل

Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System

Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This pap...

متن کامل

Load Balancing Approaches for Web Servers: A Survey of Recent Trends

Numerous works has been done for load balancing of web servers in grid environment. Reason behinds popularity of grid environment is to allow accessing distributed resources which are located at remote locations. For effective utilization, load must be balanced among all resources. Importance of load balancing is discussed by distinguishing the system between without load balancing and with loa...

متن کامل

A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems

Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to ensure that every processor in the system does almost the same amount of work at any point of time. This paper investigates dynamic loadbalancing algorithm for heterogeneous distributed systems where half of the processo...

متن کامل

Analysis of Dynamic Load Balancing Strategies Using a Combination of Stochastic Petri Nets and Queueing Networks

This paper is concerned with the analytical evaluation of two well known dynamic load balancing strategies, namely, shortest queue routing (SQR) and shortest expected delay routing (SEDR). We overcome the limitations of existing analysis methodologies, using a well known hybrid performance model that combines generalized stochastic Petri nets and product form queueing networks. Our methodology ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014